Effective Resistance Preserving Directed Graph Symmetrization

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metric preserving directed graph symmetrization

This work presents a new method for symmetrization of directed graphs that constructs an undirected graph with equivalent pairwise effective resistances as a given directed graph. Consequently a graph metric, square root of effective resistance, is preserved between the directed graph and its symmetrized version. It is shown that the preservation of this metric allows for interpretation of alge...

متن کامل

Effective graph resistance

Article history: Available online 17 March 2011 Submitted by E.R. van Dam AMS classification: 05C50 05C81 05C90 94C05 94C15

متن کامل

Graph Clustering using Effective Resistance

We design a polynomial time algorithm that for any weighted undirected graph G = (V,E,w) and sufficiently large δ > 1, partitions V into subsets V1, . . . , Vh for some h ≥ 1, such that • at most δ fraction of the weights are between clusters, i.e. w(E − ∪hi=1E(Vi)) . w(E) δ ; • the effective resistance diameter of each of the induced subgraphs G[Vi] is at most δ 3 times the average weighted de...

متن کامل

An Effective Method for Utility Preserving Social Network Graph Anonymization Based on Mathematical Modeling

In recent years, privacy concerns about social network graph data publishing has increased due to the widespread use of such data for research purposes. This paper addresses the problem of identity disclosure risk of a node assuming that the adversary identifies one of its immediate neighbors in the published data. The related anonymity level of a graph is formulated and a mathematical model is...

متن کامل

When Symmetrization Guarantees Synchronization in Directed Networks

We review and illustrate our recent results on globally stable synchronization in directed oscillator networks. We consider asymmetrically connected networks with node balance, the property that the sum of the coupling coefficients of all edges directed to a node equals the sum of the coupling coefficients of all the edges directed outward from the node. We show that for such directed but node ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications

سال: 2019

ISSN: 0895-4798,1095-7162

DOI: 10.1137/18m1172892